Preprocessing Imprecise Points and Splitting Triangulations
نویسندگان
چکیده
منابع مشابه
Preprocessing Imprecise Points and Splitting Triangulations
Traditional algorithms in computational geometry assume that the input points are given precisely. In practice, data is usually imprecise, but information about the imprecision is often available. In this context, we investigate what the value of this information is. We show here how to preprocess a set of disjoint regions in the plane of total complexity n in O(n logn) time so that if one poin...
متن کاملUnions of Onions: Preprocessing Imprecise Points for Fast Onion Decomposition
4 Let D be a set of n pairwise disjoint unit disks in the plane. We describe how to build a data structure for D so that 5 for any point set P containing exactly one point from each disk, we can quickly find the onion decomposition (convex 6 layers) of P . 7 Our data structure can be built in O(n logn) time and has linear size. Given P , we can find its onion decomposition 8 in O(n log k) time,...
متن کاملUnions of Onions: Preprocessing Imprecise
Let D be a set of n pairwise disjoint unit disks in the plane. 8 We describe how to build a data structure for D so that for any point 9 set P containing exactly one point from each disk, we can quickly find 10 the onion decomposition (convex layers) of P . 11 Our data structure can be built in O(n logn) time and has linear size. 12 Given P , we can find its onion decomposition in O(n log k) ti...
متن کاملSeparability of Imprecise Points
An imprecise point is a point p with an associated imprecision region Ip indicating the set of possible locations of the point p. We study separability problems for a set R of red imprecise points and a set B of blue imprecise points in R, where the imprecision regions are axis-aligned rectangles and each point p ∈ R∪B is drawn uniformly at random from Ip. Our results include algorithms for fin...
متن کاملDelaunay Triangulations for Moving Points
This paper considers the problem of updating efficiently a Delaunay triangulation when vertices are moving under small perturbations. Its main contribution is a set of algorithms based on the concept of vertex tolerance. Experiment shows that it is able to outperform the naive rebuilding algorithm in certain conditions. For instance, when points, in two dimensions, are relocated by Lloyd’s iter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2010
ISSN: 0097-5397,1095-7111
DOI: 10.1137/090753620